Tracking Variability in Learning: Contrasting Statistical and Similarity-Based Accounts
نویسندگان
چکیده
Learning to categorize objects involves learning which sources of variability are meaningful and which should be ignored or generalized. In this light, theories and models of category learning can be viewed as accounts of how people capture and represent meaningful variation. Similarity-based models, such as prototype and exemplar models, cannot correctly predict that humans classify a stimulus halfway between the nearest members of a low-variability and high-variability category into the high-variability category. Distributional accounts, descending from the unequal variance signal detection model, can accommodate the result. We present a simple extension to similarity-based models that allows them to display the sensitivity to category variability that humans display. We conclude by discussing what constitutes similarity-based representations and processes and noting the points of convergence between similarity-based and distributional approaches. Humans operate in environments marked by variability. For instance, categorizing a novel stimulus (e.g., determining whether a person is friend or foe) involves generalizing from past experiences that differ from one another and the current situation. In this light, models of category learning are accounts of which sources of variability are meaningful and which should be ignored (i.e., generalized). For instance, prototype models abstract (i.e., average) across previous category members to form a central tendency or prototype (Posner & Keele, 1968). In prototype models, the meaningful way in which items vary is in their similarity (i.e., distance) to category prototypes. Exemplar models deem other sources of variability meaningful. Rather than storing a summary of previously experienced items as prototype models do, exemplar models store every experienced example in memory (Medin & Schaffer, 1978). In exemplar models, the meaningful way in which items vary is in the sum of their pairwise similarities (i.e., distances) to the exemplars representing each category. Although prototype and exemplar models offer quite different accounts of how categories are represented, they both use similarity-based processing and can make overlapping predictions. Figure 1 illustrates a case in which these models’ predictions converge. Participants learned to classify lines varying in length into one of two categories. Training items are illustrated as dark triangles. The six items (L1–L6) forming one category are relatively less variable than the six items (H1–H6) forming the contrasting category. Following training, participants classified a variety of items, including some items that were not experienced during training, such as item N6. These novel items are tests of how participants generalize. Item N6 is of particular interest as it is halfway between the nearest trained members (L6 and H1) of the lowvariability and high-variability categories. Both prototype and exemplar models strongly predict that participants will classify border itemN6 into the low-variance category because the same similarity metric is used for the low-variance and the high-variance categories, and the prototype for the low-variance category is closer to N6 as are the exemplars forming the low-variance category. In contrast, distributional approaches, such as general recognition theory (Ashby & Townsend, 1986) and the category density model (Fried & Holyoak, 1984), predict that item N6 should belong to the high-variance category. These distributional approaches are descendants of the unequal variance signal detection model (Green & Swets, 1966) and represent variability information separately for each category. Distributional approaches seem normative in that they use information about how members of a category vary from one another and this information can potentially improve accuracy. In Figure 1, the density functions of unequal variance depict the category representations of a distributional model. The density function for the high-variability category is above the curve for the low-variability category at N6’s location. Therefore, the distributional model predicts N6 belongs to the high-variability category. To foreshadow the results, participants are sensitive to the variability across category members as predicted by distributional models and classify the border item N6 into the high-variance category. This result seems to undermine existing similarity-based approaches and favor distributional approaches. However, given the remarkable success of similarity-based models of categorization, it would be imprudent to discard this class of models out of hand. The core intuitions underlying similarity-based models encompass constructs like the representativeness heuristic (Tversky & Kahneman, 1974). Moreover, findings like the inverse base rate effect (Medin & Edelson, 1988) are problematic for distributional approaches. To reconcile this impasse, we present a simple extension to a similarity-based model that allow it to develop category representations that are sensitive to distributional information that unequal variance models can exploit. In General Discussion, we will present related work in light of our findings. We should briefly note that although numerous studies have explored the effects of variability on categorization, the true nature and extent of these effects is far from clear. Earlier work exploring the influence of category variability has not been diagnostic in evaluating similaritybased and distributional accounts (e.g., Homa & Vosburgh, 1976; Posner & Keele, 1968). Fried and Holyoak (1984) N1 N2 L1 . . L6 N3 N4 N5 N6 N7 N8 N9 H1 H2 H3 H4 H5 H6 N10 N11 Low-variability category High-variability category Item Length in pixels (100 pixels = 33.25 mm) C1: 120 130 140 150 160 170 180 190 200 210 220 230 250 270 290 310 330 340 350 260 250 240 230 220 210 200 190 180 170 160 150 130 110 90 70 50 40 30 C2: . .
منابع مشابه
A Novel Method for Tracking Moving Objects using Block-Based Similarity
Extracting and tracking active objects are two major issues in surveillance and monitoring applications such as nuclear reactors, mine security, and traffic controllers. In this paper, a block-based similarity algorithm is proposed in order to detect and track objects in the successive frames. We define similarity and cost functions based on the features of the blocks, leading to less computati...
متن کاملDetection of Fake Accounts in Social Networks Based on One Class Classification
Detection of fake accounts on social networks is a challenging process. The previous methods in identification of fake accounts have not considered the strength of the users’ communications, hence reducing their efficiency. In this work, we are going to present a detection method based on the users’ similarities considering the network communications of the users. In the first step, similarity ...
متن کاملEye-Tracking Method’ Usage for Understanding the Cognitive Processes in Multimedia Learning
Introduction: Designing multimedia learning environments should consist of the evidence-based study and principals about the human learning process. Eye tracking is a way based on the learner processing of learning materials which presented in multimedia learning environments. The aim of the study was to examine the use of the eye-tracking method to investigate the cognitive processes in m...
متن کاملOnline multiple people tracking-by-detection in crowded scenes
Multiple people detection and tracking is a challenging task in real-world crowded scenes. In this paper, we have presented an online multiple people tracking-by-detection approach with a single camera. We have detected objects with deformable part models and a visual background extractor. In the tracking phase we have used a combination of support vector machine (SVM) person-specific classifie...
متن کاملAn Efficient Target Tracking Algorithm Based on Particle Filter and Genetic Algorithm
In this paper, we propose an efficient hybrid Particle Filter (PF) algorithm for video tracking by employing a genetic algorithm to solve the sample impoverishment problem. In the presented method, the object to be tracked is selected by a rectangular window inside which a few numbers of particles are scattered. The particles’ weights are calculated based on the similarity between feature vecto...
متن کامل